◀ Prev · Parts · Full · Next ▶

cite-note-0-99. ↑ citerefknuth1998Knuth, Donald E. (1998). The art of computer programming, volume 3: (2nd ed.) sorting and searching. USA: Addison Wesley Longman Publishing Co., Inc. pp. 536–549. ISBN 978-0-201-89685-5.

cite-note-1010. ↑ Knuth, Donald (1963), Notes on "Open" Addressing, archived from the original on 2016-03-03

cite-note-1111. ↑ citerefkonheimweiss1966Konheim, Alan G.; Weiss, Benjamin (November 1966). "An Occupancy Discipline and Applications". SIAM Journal on Applied Mathematics. 14 (6): 1266–1274. doi:10.1137/0114101. ISSN 0036-1399.

cite-note-1212. ↑ citerefcarterwegman1979Carter, J. Lawrence; Wegman, Mark N. (1979-04-01). "Universal classes of hash functions". Journal of Computer and System Sciences. 18 (2): 143–154. doi:10.1016/0022-0000(79)90044-8. ISSN 0022-0000.

◀ Prev · Parts · Full · Next ▶